A constructive characterization of the split closure of a mixed integer linear program

Two independent proofs of the polyhedrality of the split closure of mixed integer linear program have been previously presented. Unfortunately neither of these proofs is constructive. In this paper, we present a constructive version of this proof. We also show that split cuts dominate a family of inequalities introduced by Köppe and Weismantel.     

A polynomial algorithm for one problem of guillotine cutting

We consider the problem of guillotine cutting a rectangular sheet into two rectangular pieces without rotations. The question is whether there exists a cutting pattern with given numbers of occurrences of both rectangular pieces. A polynomial time algorithm is described to construct the convex hull of solutions to this problem.     

Simplest optimal cutting patterns for equal rectangles

This paper presents branch-and-bound algorithms that can guarantee the simplest optimal cutting patterns of equal rectangles. An existing linear algorithm determines the global upper bound exactly. The branching process ends when a branch of a lower bound equal to the global upper bound is found.     

Solution of the hyperbolic mild‐slope equation using the finite volume method

A finite volume solver for the 2D depth‐integrated harmonic hyperbolic formulation of the mild‐slope equation for wave propagation is presented and discussed. The solver is implemented on unstructured triangular meshes and the solution methodology is based upon a Godunov‐type second‐order finite volume scheme, whereby the numerical fluxes are computed using Roe's flux function. The eigensystem of the mild‐slope equations is derived and used for the construction of Roe's matrix. A formulation that updates the unknown variables in time implicitly is presented, which produces a more accurate and reliable scheme than hitherto available. Boundary conditions for different types of boundaries are also derived. The agreement of the computed results with analytical results for a range of wave propagation/transformation problems is very good, and the model is found to be virtually paraxiality‐free. Copyright © 2003 John Wiley & Sons, Ltd.     

基于单纯形方法的双层线性规划全局优化算法

通过分析双层线性规划可行域的结构特征和全局最优解在约束域的极点上达到这一特性,对单纯形方法中进基变量的选取法则进行适当修改后,给出了一个求解双层线性规划局部最优解方法,然后引进上层目标函数对应的一种割平面约束来修正当前局部最优解,直到求得双层线性规划的全局最优解.提出的算法具有全局收敛性,并通过算例说明了算法的求解过程.     

Objective acoustic voice-quality parameters in the computer phonetogram

A phonetogram is a plot of the dynamic range of the voice as a function of fundamental frequency. Traditionally, the phonetogram only records the sound-pressure level (SPL) of the threshold of phonation and the upper limit in SPL the voice can reach with sustained phonation as a function of the fundamental frequency (F₀). In this study, the phonetogram is extended by including acoustic voice-quality parameters. Three additional parameters are tested: jitter, shimmer, and crest factor. For each individual voice, the variation in the three parameters is evaluated over the entire phonetogram area. By averaging individual phonetograms, standard or norm phonetograms are obtained revealing general patterns in voice-quality variation. These patterns reflect the complex relations between F₀, SPL, and the acoustic voice-quality parameters just mentioned. Jitter and shimmer distributions over the phonetogram show that large variations in perturbation values can be expected when production conditions are altered. Highest perturbation values are found for the low F₀ and low SPL phonations. For all voices, a gradual decrease of the crest factor is found with increasing F₀, reflecting the degrading of spectral complexity with F₀. The crest-factor parameter can also be used to mark those areas in the phonetogram where the fundamental dominates the waveform and where flow control is the main SPL regulating mechanism in voice production. The strong quality variations within the phonetogram stress the need for accurate control of F₀ and SPL in objective voice-quality measurement.     

A two step algorithm for solving a large scale semi-definite logit model

This paper proposes a two step algorithm for solving a large scale semi-definite logit model, which is appreciated as a powerful model in failure discriminant analysis. This problem has been successfully solved by a cutting plane (outer approximation) algorithm. However, it requires much more computation time than the corresponding linear logit model. A two step algorithm to be proposed in this paper is intended to reduce the amount of computation time by eliminating a certain portion of the data based on the information obtained by solving an associated linear logit model. It will be shown that this algorithm can generate a solution with almost the same quality as the solution obtained by solving the original large scale semi-definite model within a fraction of computation time.     

用Talbot效应及云纹干涉法测试镜面反射体曲率和斜率的灵敏度分析

对用Talbot效应及云纹干涉法测试镜面反射体曲率和斜率的灵敏度进行了分析,同时给出了由于光栅稀密对测试的影响和相应的解释。这对从事这项工作或工程上利用此技术测试物体曲率和斜率提供了一个可行的方案。     

A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem

In this paper we address a two-dimensional (2D) orthogonal packing problem, where a fixed set of small rectangles has to be placed on a larger stock rectangle in such a way that the amount of trim loss is minimized. The algorithm we propose hybridizes a placement procedure with a genetic algorithm based on random keys. The approach is tested on a set of instances taken from the literature and compared with other approaches. The computation results validate the quality of the solutions and the effectiveness of the proposed algorithm.     

旋转锥镜相机研测动态曲率和斜率

采用旋转锥镜相机，进行激光散斑剪切照相，研测缓慢变形物体的动态曲率和斜率。拍摄一张散斑图即可获得曲率和斜率动态变化的全过程。